Invariant multidimensional matrices
نویسندگان
چکیده
In [AO] the authors study Steiner bundles via their unstable hyperplanes and proved that (see [AO], Tmm 5.9) : A rank n Steiner bundle on Pn which is SL(2,C) invariant is a Schwarzenberger bundle. In this note we give a very short proof of this result based on Clebsch-Gordon problem for SL(2,C)modules.
منابع مشابه
SOLUTION-SET INVARIANT MATRICES AND VECTORS IN FUZZY RELATION INEQUALITIES BASED ON MAX-AGGREGATION FUNCTION COMPOSITION
Fuzzy relation inequalities based on max-F composition are discussed, where F is a binary aggregation on [0,1]. For a fixed fuzzy relation inequalities system $ A circ^{F}textbf{x}leqtextbf{b}$, we characterize all matrices $ A^{'} $ For which the solution set of the system $ A^{' } circ^{F}textbf{x}leqtextbf{b}$ is the same as the original solution set. Similarly, for a fixed matrix $ A $, the...
متن کاملNondegenerate Multidimensional Matrices and Instanton Bundles
In this paper we prove that the moduli space of rank 2n symplectic instanton bundles on P2n+1, defined from the well-known monad condition, is affine. This result was not known even in the case n = 1, where by Atiyah, Drinfeld, Hitchin, and Manin in 1978 the real instanton bundles correspond to self-dual Yang Mills Sp(1)-connections over the 4-dimensional sphere. The result is proved as a conse...
متن کاملSparse and low-rank approximations of large symmetric matrices using biharmonic interpolation
Geodesic distance matrices can reveal shape properties that are largely invariant to non-rigid deformations, and thus are often used to analyze and represent 3-D shapes. However, these matrices grow quadratically with the number of points. Thus for large point sets it is common to use a low-rank approximation to the distance matrix, which fits in memory and can be efficiently analyzed using met...
متن کاملInvariant and Type Inference for Matrices
We present a loop property generation method for loops iterating over multi-dimensional arrays. When used on matrices, our method is able to infer their shapes (also called types), such as upper-triangular, diagonal, etc. To generate loop properties, we first transform a nested loop iterating over a multidimensional array into an equivalent collection of unnested loops. Then, we infer quantifie...
متن کاملOreModules: A symbolic package for the study of multidimensional linear systems
In the seventies, the wish to study transfer matrices of time-invariant finite-dimensional linear systems has led to the development of the polynomial approach in which the canonical forms of matrices of univariate polynomials were studied (e.g., Hermite and Smith forms, invariant factors, primeness). In the middle of the seventies, while generalizing linear systems defined by ordinary differen...
متن کامل